Rijksuniversiteit te Leiden Vakgroep Informatica Using L - Systems as Graph Grammar : G 2 L - Systems Egbert
نویسنده
چکیده
منابع مشابه
Trend analysis in L-fuzzy contexts with absent values
Sometimes we have to work with $L$-fuzzy context sequences where one or more values are missing. These sequences can represent, among other things, the evolution in time of an $L$-fuzzy context. The studies of tendencies that we have done so far used tools that are not valid when the $L$-fuzzy context has unknown values. In this work we address such situations and we propose new methods to tac...
متن کاملAlternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کاملReaction Cycles in Membrane Systems and Molecular Dynamics
1 Leiden University, Mathematical Institute Niels Bohrweg 1, 2333 CA Leiden, The Netherlands [email protected] 2 Vrije Universiteit Amsterdam, Faculteit der Bewegingswetenschappen Van der Boechorststraat 9, 1081 BT Amsterdam, The Netherlands [email protected] 3 Leiden University, Leiden Institute of Advanced Computer Science Niels Bohrweg 1, 2333 CA Leiden, The Netherlands {rbrijd...
متن کاملAnalysis Grammar of Japanese in the Mu-Project: A Procedural Approach to Analysis Grammar
Ana lys ts grammar of Japanese tn the Mu-proJect ts presented, I t is emphasized t h a t ru les express ing c o n s t r a i n t s on s tng le l i n g u i s t i c s t r uc tu res and ru les f o r s e l e c t i n g the most p r e f e r a b l e readtngs are comp le te l y d i f f e r e n t In na tu re , and t h a t ru les f o r s e l e c t i n g p r e f e r a l e readings should be u t i l i z e d...
متن کاملENTROPY OF DYNAMICAL SYSTEMS ON WEIGHTS OF A GRAPH
Let $G$ be a finite simple graph whose vertices and edges are weighted by two functions. In this paper we shall define and calculate entropy of a dynamical system on weights of the graph $G$, by using the weights of vertices and edges of $G$. We examine the conditions under which entropy of the dynamical system is zero, possitive or $+infty$. At the end it is shown that, for $rin [0,+infty]$, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995